A Human-Checkable Four-Color Theorem Proof
نویسنده
چکیده
This paper presents a short and simple proof of the Four-Color Theorem, which can be utterly checkable by human mathematicians, without computer assistance. The new key idea that has permitted it is presented in the Introduction. Mathematics Subject Classification (2010). Primary 05C10; Secondary 05C15.
منابع مشابه
A formal proof of the four color theorem
A formal proof has not been found for the four color theorem since 1852 when Francis Guthrie first conjectured the four color theorem. Why? A bad idea, we think, directed people to a rough road. Using a similar method to that for the formal proof of the five color theorem, a formal proof is proposed in this paper of the four color theorem, namely, every planar graph is four-colorable. The forma...
متن کاملOn Dinur’s Proof of the Pcp Theorem
Probabilistically checkable proofs are proofs that can be checked probabilistically by reading very few bits of the proof. In the early 1990s, it was shown that proofs could be transformed into probabilistically checkable ones with only a modest increase in their length. The initial transformations, though elementary, were a little too complex. A recent work due to Irit Dinur gives a dramatical...
متن کاملProbabilistic Checking of Proofs and Hardness of Approximation
This paper introduces basic notions of classic computational complexity theory and probabilistically checkable proof. It sketches the proof of the PCP theorem, and discusses its applications to the hardness of approximation of various problems.
متن کاملCS 286 . 2 Lecture 1 : The PCP theorem , hardness of approximation , and multiplayer games Scribe :
Our first formulation gives the theorem its name (PCP = Probabilistically Checkable Proof). It states that, provided that one is willing to settle for a probabilistic decision process that errs with small probability, all languages in NP have proofs that can be verified very efficiently: only a constant number of symbols of the proof need to be evaluated! To state this formally we first need th...
متن کاملRuntime Verification of Remotely Executed Code using Probabilistically Checkable Proof Systems
In this paper we consider the verification and certification of computations that are done remotely. We investigate the use of probabilistically checkable proof (PCP) systems for efficiently certifying such computations. This model can also be applied to verifying security proofs of software downloads. To make the use of PCPs more practical, a new version of Cook’s Theorem is given for the RAM ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1708.07442 شماره
صفحات -
تاریخ انتشار 2017